منابع مشابه
Functions as proofs as processes
This paper presents a logical approach to the translation of functional calculi into concurrent process calculi. The starting point is a type system for the π-calculus closely related to linear logic. Decompositions of intuitionistic and classical logics into this system provide type-preserving translations of the λand λμ-calculus, both for call-by-name and call-by-value evaluation strategies. ...
متن کاملLazy Functions as Processes
CPS transforms have long been important tools in the study of programming languages, especially those related to the λ-calculus. Recently, it has been shown that encodings into process calculi, such as the π-calculus, can also serve as semantics, in the same way as CPS transforms. It is known that common encodings of the call-byvalue and call-by-name λ-calculi into the π-calculus can be seen as...
متن کاملEvaluating functions as processes
A famous result by Milner is that the λ -calculus can be simulated inside the π-calculus. This simulation, however, holds only modulo strong bisimilarity on processes, i.e. there is a slight mismatch between β -reduction and how it is simulated in the π-calculus. The idea is that evaluating a λ -term in the π-calculus is like running an environment-based abstract machine, rather than applying o...
متن کاملFunctions as Session-Typed Processes
We study type-directed encodings of the simply-typed λ-calculus in a session-typed π-calculus. The translations proceed in two steps: standard embeddings of simply-typed λ-calculus in a linear λ-calculus, followed by a standard translation of linear natural deduction to linear sequent calculus. We have shown in prior work how to give a Curry-Howard interpretation of the proofs in the linear seq...
متن کاملAn Investigation into Functions as Processes
In Mil90] Milner examines the encoding of the-calculus into the-calculus MPW92]. The former is the universally accepted basis for computations with functions, the latter aims at being its counterpart for computations with processes. The primary goal of this paper is to continue the study of Milner's encodings. We focus mainly on the lazy-calculus Abr87]. We show that its encoding gives rise to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 1992
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129500001407